skip to main content
US FlagAn official website of the United States government
dot gov icon
Official websites use .gov
A .gov website belongs to an official government organization in the United States.
https lock icon
Secure .gov websites use HTTPS
A lock ( lock ) or https:// means you've safely connected to the .gov website. Share sensitive information only on official, secure websites.

Explore Research Products in the PAR
It may take a few hours for recently added research products to appear in PAR search results.


  • Home
  • Search Results
  • Page 1 of 1

Search for: All records

Creators/Authors contains: "St. Dizier, Avery"

Note: When clicking on a Digital Object Identifier (DOI) number, you will be taken to an external site maintained by the publisher. Some full text articles may not yet be available without a charge during the embargo (administrative interval).
What is a DOI Number?

Some links on this page may take you to non-federal websites. Their policies may differ from this site.

  1. ; ; (, Algebraic Combinatorics)
    Full Text Available 
  2. ; ; ; (, Transactions of the American Mathematical Society)
    We show that normalized Schur polynomials are strongly log-concave. As a consequence, we obtain Okounkov’s log-concavity conjecture for Littlewood–Richardson coefficients in the special case of Kostka numbers. 
    more » « less
    Full Text Available 
  3. ; ; (, The Electronic Journal of Combinatorics)
    Schur polynomials are special cases of Schubert polynomials, which in turn are special cases of dual characters of flagged Weyl modules. The principal specialization of Schur and Schubert polynomials has a long history, with Macdonald famously expressing the principal specialization of any Schubert polynomial in terms of reduced words. We prove a lower bound on the principal specialization of dual characters of flagged Weyl modules. Our result yields an alternative proof of a conjecture of Stanley about  the principal specialization of Schubert polynomials, originally proved by Weigandt. 
    more » « less
    Full Text Available 
  4. ; (, Algebraic Combinatorics)
    null (Ed.)
    Full Text Available